degree n. 1.程度;等级。 2.阶层,地位。 3.学位,学术。 4.度,度数。 5.【数学】次;幂。 6.【音乐】阶,度,音程。 7.【语法】(形容词和副词的)级。 8.【法律】亲等。 He was tired to such a degree that he fainted. 他疲乏得昏了过去。 people of every degree 各阶层的人们。 a man of high degree 地位高的人们。 give [take] a degree 授与[取得]学位。 the prohibited degrees (of marriage) 禁止结婚的亲等 〔一、二、三等亲〕。 third degree 〔美国〕(警察的)严厉的拷问。 by degrees 渐次,渐渐,逐渐。 by slow degrees 慢慢,一点儿一点儿地。 degree of frost 零下(10 degrees of frost 零下10度)。 in a degree 有一点儿。 in its degree 各有(所长等)(Each is useful in its degree. 各有不同程度的用处)。 in some degree 多少。 to a certain degree 相当。 to a degree 非常;〔美国〕有点。 to the last degree 极端,再…没有了。
maximum n. (pl. maximums, -ma ) 极点,最大,最高,最高额,最大值;最高点;最大限度;【数学】极大(值)(opp. minimum)。 The excitement was at its maximum. 兴奋到极点。 adj. 最大的,最高的,顶点的,最多的。 maximum draught [draft] 【航海】最大吃水深度。 maximum obscuration 【天文学】蚀甚。 a maximum range 最大射程。 a maximum thermometer 最高温度计。
This maximum degree of enrichment for any one distillation step is said to represent one theoretical plate . 对于任意一个蒸馏步骤,就称此最大浓度相当于一个理论板。
The strong chromatic index of graphs with maximum degree 最大度等于5的图的强边色数
The maximum degree of parallelism is configured just like parallel queries 最大并行度的配置与配置并行查询相同。
Target threat evaluating and sequencing method based on the maximum degree of membership 基于模糊多属性决策的威胁度评估与排序研究
The maximum degree of parallelism is configured just like that of parallel queries 最大并行度的配置就像并行查询的最大并行度一样。
The maximum degree of parallelism is configured in the same manner as that of parallel queries 并行度由查询处理器自动确定。最大并行度的配置方式与并行查询相同。
The max degree option on dsntip4 determines the maximum degree of parallelism maximum number of parallel tasks Dsntip4上的max degree选项决定了最大并行度(并行任务的最大数量) 。
( 2 ) if the maximum degree of any pair of nonadjacent vertices is at least , then g can be partitioned into k subgraphs hi which hi is a cycle or a path ( 1 i k ) ( 1 )如果任何一对不相邻顶点的度和至少为n k ,则g能被剖分成k个子图从(二三卜k ) ,其中从是圈或路
A color a e x is legal for an uncolored vertex v e v if by coloring v with a , the subgraph induced by all vertices of color a has maximum degree at most d 对顶点v是合法的,是指由所有染颜色。的顶点导出的子图的最大度至多是d ,其中alice和bob每走一步都是用合法颜色染未染色点。
We prove that halin graphs , 1 - trees and outerplanar graphs satisfy the conjecture presented by n . alon that the acyclic edge chromatic number of any graph does not exceed its maximum degree plus 2 证明了halin图、 1 -树和外平面图满足由n . alon提出的任何一个图的无圈边色数不超过其最大度加2的猜想。